package javajichu.shuozhu.Zuoyei;
import java.util.Arrays;
public class Zy8 {
    public static void main(String[] args) {
        int[] num = { 2, 6, 5, 8, 7, 9, 11, 20, 14, 15, 24, 26, 30, 3, 13, 37,
                34, 43, 41, 4 };
        Arrays.sort(num);
        for (int i = num.length - 1; i >= 0; i--) {
            if (num[19] == num[i]) {
                continue;
            } else {
                System.out.print("\n数组中第二大的数:" + num[i]);
                break;
            }
        }
    }
}
